#include<bits/stdc++.h>
using namespace std;
long long n,a[100005],vis=1;
int main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	scanf("%lld",&n);
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
	}
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){
		if(a[i]>a[vis]) vis++;
	}
	printf("%lld",n-vis+1);
	return 0;
}
